Probabilistic Logic Programming under Maximum Entropy Justus-liebig- Universit at Gieeen Ifig Research Report Probabilistic Logic Programming under Maximum Entropy
نویسندگان
چکیده
In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by deening probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an eecient linear programming characterization for the problem of deciding whether a probabilistic logic program is satissable. Finally, and as a main result of this paper, we introduce an eecient technique for approximative probabilistic logic programming under maximum entropy. This technique reduces the original entropy maximization task to solving a modiied and relatively small optimization problem.
منابع مشابه
Probabilistic and Truth-functional Many-valued Logic Programming Justus-liebig- Universit at Gieeen Ifig Research Report Probabilistic and Truth-functional Many-valued Logic Programming
We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...
متن کاملProbalilistic Logic Programming under Maximum Entropy
In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by deening probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an ef-cient linear programming characterization for the problem of deciding whether a probabilistic logic program is satissable. Finally...
متن کاملCombining probabilistic logic programming with the power of maximum entropy
This paper is on the combination of two powerful approaches to uncertain reasoning: logic programming in a probabilistic setting, on the one hand, and the information-theoretical principle of maximum entropy, on the other hand. More precisely, we present two approaches to probabilistic logic programming under maximum entropy. The first one is based on the usual notion of entailment under maximu...
متن کاملAn integrated development environment for probabilistic relational reasoning
This paper presents KReator, a versatile integrated development environment for probabilistic inductive logic programming currently under development. The area of probabilistic inductive logic programming (or statistical relational learning) aims at applying probabilistic methods of inference and learning in relational or first-order representations of knowledge. In the past ten years the commu...
متن کاملEvaluation and Comparison Criteria for Approaches to Probabilistic Relational Knowledge Representation
In the past ten years, the areas of probabilistic inductive logic programming and statistical relational learning put forth a large collection of approaches to combine relational representations of knowledge with probabilistic reasoning. Here, we develop a series of evaluation and comparison criteria for those approaches and focus on the point of view of knowledge representation and reasoning. ...
متن کامل